Randomized algorithms

Results: 419



#Item
81

PDF Document

Add to Reading List

Source URL: www.math.stevens.edu

Language: English - Date: 2008-11-13 14:12:11
82

PDF Document

Add to Reading List

Source URL: fellowship.ercim.eu

Language: English - Date: 2014-02-04 07:37:28
83

PDF Document

Add to Reading List

Source URL: tcs.postech.ac.kr

Language: English - Date: 2014-06-15 09:21:09
84Homework #6 in Design and Analysis of Algorithms Part I  Question 1 Let A be a randomized decision algorithm for some problem P (in particular, it may be a property testing algorithm (that performs an “approximate” d

Homework #6 in Design and Analysis of Algorithms Part I Question 1 Let A be a randomized decision algorithm for some problem P (in particular, it may be a property testing algorithm (that performs an “approximate” d

Add to Reading List

Source URL: www.eng.tau.ac.il

Language: English
    85Homework #5 in Design and Analysis of Algorithms  Question 1 Let A be a randomized approximation algorithm for a certain counting problem such that given any input I to the problem and an approximation parameter 0 < ǫ <

    Homework #5 in Design and Analysis of Algorithms Question 1 Let A be a randomized approximation algorithm for a certain counting problem such that given any input I to the problem and an approximation parameter 0 < ǫ <

    Add to Reading List

    Source URL: www.eng.tau.ac.il

    Language: English
      86Randomized Algorithms for Fast Bayesian Hierarchical Clustering Katherine A. Heller and Zoubin Ghahramani Gatsby Computational Neuroscience Unit University College London, London, WC1N 3AR, UK {heller,zoubin}@gatsby.ucl.

      Randomized Algorithms for Fast Bayesian Hierarchical Clustering Katherine A. Heller and Zoubin Ghahramani Gatsby Computational Neuroscience Unit University College London, London, WC1N 3AR, UK {heller,zoubin}@gatsby.ucl.

      Add to Reading List

      Source URL: www.gatsby.ucl.ac.uk

      Language: English - Date: 2005-10-18 12:07:50
      87c 2005 Society for Industrial and Applied Mathematics  SIAM J. COMPUT. Vol. 34, No. 6, pp. 1331–1351

      c 2005 Society for Industrial and Applied Mathematics  SIAM J. COMPUT. Vol. 34, No. 6, pp. 1331–1351

      Add to Reading List

      Source URL: www.cims.nyu.edu

      Language: English - Date: 2009-09-24 16:08:59
      88Randomized Algorithms for Counting, Rare-Events Estimation and Optimization Reuven Rubinstein Faculty of Industrial Engineering and Technion, Israel Institute of Technology, Haifa , Israel

      Randomized Algorithms for Counting, Rare-Events Estimation and Optimization Reuven Rubinstein Faculty of Industrial Engineering and Technion, Israel Institute of Technology, Haifa , Israel

      Add to Reading List

      Source URL: www.eurandom.tue.nl

      Language: English - Date: 2009-03-23 10:55:31
      89Approximation Algorithms for Projective Clustering  Pankaj K. Agarwalz y  Cecilia M. Procopiuc z

      Approximation Algorithms for Projective Clustering  Pankaj K. Agarwalz y Cecilia M. Procopiuc z

      Add to Reading List

      Source URL: www.cs.duke.edu

      Language: English - Date: 2011-04-05 22:51:28
      90Efficient Sensor Placement for Surveillance Problems⋆ Pankaj K. Agarwal, Esther Ezra, and Shashidhara Ganjugunte Dept. of Comp. Sci., Duke University, Durham, NCAbstract. We study the problem of covering a

      Efficient Sensor Placement for Surveillance Problems⋆ Pankaj K. Agarwal, Esther Ezra, and Shashidhara Ganjugunte Dept. of Comp. Sci., Duke University, Durham, NCAbstract. We study the problem of covering a

      Add to Reading List

      Source URL: www.cims.nyu.edu

      Language: English - Date: 2009-09-24 16:12:25